A Flow shop Production Planning Problem with basic period policy and Sequence Dependent set up times

Authors

Esmaeil Mehdizadeh Department of Industrial Engineering, Islamic Azad University of Qazvin, Qazvin, Iran

Fariborz Jolai Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran

Masoud Jenabi Department of Industrial Engineering, Amirkabir University of Technology, Tehran, Iran

Mohammad Aliabadi Department of Industrial Engineering, Islamic Azad University of Qazvin, Qazvin, Iran

Abstract:

Many authors have examined lot sizing, scheduling and sequence of multi-product flow shops, but most of them have assumed that set up times are independent of sequence. Whereas dependence of set up times to sequence is more common in practice. Hence, in this paper, we examine the discussed problem with hypothesis of dependence of set up times to sequence and cyclic schedule policy in basic period form. To do so, a mixed integer non-linear programming (NLP) model is developed for this problem. To solve the model these techniques are applied: Heuristic G-group for determining the frequency of item production and assigning product to periods and three meta heuristic methods including hybrid Particle swarm optimization , hybrid Vibration damping optimization hybrid genetic algorithm are used to determine the sequence and economic lot sizes of each item. In addition, to compare these methods, some random problems are produced and computation of them shows the substantial superiority of hybrid Particle swarm optimization.

Upgrade to premium to download articles

Already have an account?login

similar resources

A three-stage assembly flow shop scheduling problem with blocking and sequence-dependent set up times

This paper considers a three-stage assembly flowshop scheduling problem with sequence-dependent setup < /div> times at the first stage and blocking times between each stage in such a way that the weighted mean completion time and makespan are minimized. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time using traditiona...

full text

Solving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times

Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...

full text

Solving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times

full text

A bi-objective model for the assembly flow shop scheduling problem with sequence dependent setup times and considering energy consumption

full text

GENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS

This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...

full text

an assembly flow-shop scheduling problem with sequence-dependent setup and transportation times

in this paper, three-stage assembly flowshop scheduling is considered with respect to minimizing bi-objectives, namely mean flow time and mean tardiness. this problem is a model of production systems, which several production operations are done simultaneously and independently, and then produced components are collected and transferred to an assembly stage for the final operation. in this mode...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}

Journal title

Journal of Industrial and Systems Engineering

volume 5 issue 1

pages 1- 19

publication date 2011-04-01

unfollow

{@ msg @}

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Flow shop Determining lot sizes Finite planning horizon Hybrid particle swarm optimization Basic period

Hosted on Doprax cloud platform doprax.com